Nonmonotone Strategy for Minimization of Quadratics with Simple Constraints
نویسندگان
چکیده
منابع مشابه
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
In this paper we consider the problem of maximizing any submodular function subject to d knapsack constraints, where d is a fixed constant. We establish a strong relation between the discrete problem and its continuous relaxation, obtained through extension by expectation of the submodular function. Formally, we show that, for any non-negative submodular function, an α-approximation algorithm f...
متن کاملA Simple Procedure for Extracting Quadratics from a given Algebraic
Any linear time-invariant continuous or discrete system can be represented either in terms of characteristic algebraic polynomial or in the form of open-loop transfer function. The open-loop transfer function will consist of numerator polynomial and denominator polynomial. To understand the transient characteristics of the system, the denominator polynomial is analysed for its roots. Any n orde...
متن کاملBackpropagation Convergence via Deterministic Nonmonotone Perturbed Minimization
The fundamental backpropagation (BP) algorithm for training artificial neural networks is cast as a deterministic nonmonotone perturbed gradient method. Under certain natural assumptions, such as the series of learning rates diverging while the series of their squares converging, it is established that every accumulation point of the online BP iterates is a stationary point of the BP error func...
متن کاملA nonmonotone line search method for noisy minimization
is satisfied, where σ is the noise level. Alternatively, the algorithm terminates when the maximum number of 400 ·n function evaluations is exceeded. For each problem, a series of 50 independent runs are conducted. We considered a test run successful if the stopping criterium (1) is satisfied before exceeding the maximal number of function evaluations. To compare the performance of methods from...
متن کاملAn inexact and nonmonotone proximal method for smooth unconstrained minimization
An implementable proximal point algorithm is established for the smooth nonconvex unconstrained minimization problem. At each iteration, the algorithm minimizes approximately a general quadratic by a truncated strategy with step length control. The main contributions are: (i) a framework for updating the proximal parameter; (ii) inexact criteria for approximately solving the subproblems; (iii) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 2001
ISSN: 0862-7940,1572-9109
DOI: 10.1023/a:1013752209845